Fox's Git Mirrors
🗀 Files • ☸ Work (0) • 🖹 Commits (299) • ⑃ Branches (1) • ⌆ Tags (0) • ♥ Thanks (0)
-─
This is a work in progress and a long overdue attempt to bring all our coding-related code together and make it reusable for our future projects.
Before using any of this you should enter the tests directory and execute "make".
This will check if your compiler is able to create binaries that are able to produce correct results when executed.
What we have included so far:
A Cyclic redundancy check helps ensuring data integrity.
For example, if we need to integrate CRC32 checking for a few bytes, like in the following:
T282828
# echo -n 'Hello World!' | rhash -C -
(stdin) 1C291CA3
We can add it to our project as simple as that:
T282828
CODE::CRC<uint32_t> crc(0xEDB88320, 0xFFFFFFFF);
for (uint8_t c: std::string("Hello World!")) crc(c);
assert(~crc() == 0x1C291CA3);
Sometimes we need a sequence of "random enough" numbers but don't want to store them in an array to get a repeatable sequence.
Here a Pseudorandom number generator can help by prodiving a deterministic and thus repeatable sequence of numbers.
George Marsaglia discovered a class of simple and fast pseudorandom number generators, which he called Xorshift.
When dealing with unaligned and arbitrary-bit-sized elements in a data stream, the bitwise stream container might help avoiding some headaches.
Simple bit manipulation on byte arrays.
We have to thank Évariste Galois for his contribution of the Finite field to mathematics, which laid the cornerstone for a variety of applications that we take for granted today.
One of them is Reed–Solomon error correction:
Implemented are the following Encoders and Decoders:
Bit freezers for the construction of polar codes).
• PolarFreezer: Constructs code for a given erasure probability without the need for storing nor sorting of erasure probabilities for the virtual channels.
• PolarCodeConst0: Constructs code by choosing the K best virtual channels computed from a given erasure probability.
Construction of reliability sequences for polar codes).
• PolarSeqConst0: Constructs a sequence by sorting virtual channel reliabilities computed from a given erasure probability.
Successive cancellation list decoding of polar codes).
List size depends on used SIMD type. Decoding performance of the fixed-point implementation is better with shorter codes, as the list size is larger but a deterioration can be observed with larger codes.
Ordered statistics decoding allows the practical soft-decision decoding of short to medium sized linear codes.
Below are the BER plots of the BCH(127, 64) T=10 code, using the OSD Soft-decision decoder and the Reed–Solomon error correction BCH decoder with erasures.
Reduce N times while excluding ith input element
It computes the following, but having only O(N) complexity and using O(1) extra storage:
T282828
output[0] = input[1];
output[1] = input[0];
for (int i = 2; i < N; ++i)
output[i] = op(input[0], input[1]);
for (int i = 0; i < N; ++i)
for (int j = 2; j < N; ++j)
if (i != j)
output[i] = op(output[i], input[j]);
Single instruction, multiple data (SIMD) wrappers for:
• Intel SSE4.1 (sse4_1.hh)
• Intel AVX2 (avx2.hh)
SIMD element wise horizontal rotation
It computes the following, but faster:
T282828
SIMD<int8_t, SIZE> rotate(SIMD<int8_t, SIZE> input, int shift, int WIDTH)
{
SIMD<int8_t, SIZE> output;
for (int n = 0; n < WIDTH; ++n)
output.v[(n + shift + WIDTH) % WIDTH] = input.v[n];
return output;
}
Served by rngit 1.4.1 - Generated in 0.06s